A generalized neighborhood for cellular automata

k-neighborhood for Cellular Automata

A neighborhood for d-dimensional cellular automata is introduced that spans the range from von Neumann’s to Moore’s neighborhood using a parameter which represents the dimension of hypercubes connecting neighboring cells. The neighborhood is extended to include a concept of radius. The number of neighbors is calculated. For diamondshaped neighborhoods, a sequence is obtained whose partial sums ...

Different Kinds of Neighborhood-Varying Cellular Automata

The mainframe of this work has been the study of cellular automata as very simple SIMD systems. We introduce some variations over the basic definition of cellular automata in order to compare these new models with other models of cellular automata. The neighborhoodvarying cellular automata is shown to be as powerful as time-varying cellular automata. The dynamically reconfigurable cellular auto...

Weighted Majority Rule for Hybrid Cellular Automata Topology and Neighborhood

Evolution rules for Cellular Automata (CAs) able to perform computational tasks which require global coordination highlight an interesting emergent behavior. CAs can generate this complex behavior starting from a simple initial configuration based on the local interaction of simple components that evolve according to some state change rule. However, the detection of rules that exhibit coordinat...

developing a cellular automata model for urban growth

in the last decade, cellular automata models have been widely used for simulation spatial phenomena; however, exact nature of these models have been lead to various limitations for essential simulation of these phenomena. in this research, traditional cellular automata models have been developed through fuzzy theory, in which, transition rules are expressed based on fuzzy logic control methodol...

Parallel Computing with Generalized Cellular Automata